hsort() is a heap sort that is called indentically to qsort().  While I
believe qsort() has a slightly better average speed than hsort(), hsort()
does not have a 'worst case' speed loss like qsort(). If the qsort() 
items are nearly in order when it is called, qsort() is as slow as a bubble
sort, heap sorts always run at about the same speed which is very fast.
Included is a batch file to add the object file to your libs'.  Run it
in the same directory that you keep your librarys.